Improved Testability Method For Mesh-Connected VLSI Multiprocessors
نویسندگان
چکیده
منابع مشابه
Processor Management Techniques for Mesh-Connected Multiprocessors
This paper investigates various processor management techniques for improving the performance of mesh-connected multiprocessors. Three diierent techniques are analyzed. First, we use the smallest job rst (SJF) policy to improve the spatial parallelism in a mesh. Next, a policy called multitasking and multi-programming (M 2) is introduced. The M 2 scheme allows multiprogramming of jobs on variou...
متن کاملOn Dependability Evaluation of Mesh Connected Multiprocessors*
Analytical techniques for reliability and availability prediction of mesh connected systems are proposed in this paper. The models are based on the submesh requirements. First, a reliability model is proposed assuming that a submesh can be always recognized if it exits. Analysis of the linear consecutive n-out-of-N system is extended using an expanding row/column technique to evaluate the subme...
متن کاملOptimal component labeling algorithms for mesh-connected computers and VLSI
Given an undirected graph G of n weighted edges, stored one edge per processor in a square mesh of n processors, we show how to determine the connected components and a minimal spanning forest in Θ( √ n) time. More generally, we show how to solve these problems in Θ(n1/d) time when the mesh is a d-dimensional cube, where the implied constants depend upon d.
متن کاملAn Improved Method for RTL Synthesis with Testability Tradeo s
A method for high-level synthesis with testability is presented with the objective to generate self-testable RTL datapath structures. We base our approach on a new improved testabilitymodel that generates various testable design styles while reducing the circuit sequential depth from controllable to observable registers. We follow the allocation method with an automatic test point selection alg...
متن کاملDistributive Join Algorithm for Cube-Connected Multiprocessors
This paper presents a parallel distributive join algorithm for cube-connected multiprocessors. The performance analysis shows that the proposed algorithm has an almost linear speedup over the sequential distributive join algorithm [NEGSl] as the number of processors increases, and its performance is comparable to that of the parallel hybridhash join algorithm [OMI89]. A big advantage of the pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jordanian Journal of Computers and Information Technology
سال: 2018
ISSN: 2413-9351
DOI: 10.5455/jjcit.71-1517646258